- 01. Course Overview
- 02. About this Lesson
- 03. How to Solve Problems
- 04. Days Between Dates
- 05. Attempting the Problem [workspace]
- 06. First Step
- 07. Understanding a Problem
- 08. The First Rule
- 09. What Are the Inputs
- 10. How Are Inputs Represented
- 11. What Are the Outputs
- 12. Obey the Rules
- 13. Next Step
- 14. The Expected Output
- 15. Take the Next Step
- 16. Try an Example
- 17. Harder Example
- 18. Algorithm Pseudocode
- 19. Should We Implement It
- 20. Different Approach
- 21. Simple Mechanical Algorithm
- 22. Don't Optimize Prematurely
- 23. What Should We Write First
- 24. Define Simple nextDay
- 25. Making Progress Is Good
- 26. What Should We Do Next
- 27. Define daysBetweenDates
- 28. Step One Pseudocode
- 29. Step Two Helper Function
- 30. Step Three daysBetweenDates
- 31. Test for Valid Inputs
- 32. Real World Problem
- 33. Best Strategy
- 34. Completing the Problem
- 35. Finish daysBetweenDates
- 36. Solution Step I
- 37. Solution Step II
- 38. Solution Step III
- 39. Solution Step IV
- 40. Conclusion